Orthogonal Learning Particle Swarm Optimization
نویسندگان
چکیده
منابع مشابه
Orthogonal Particle Swarm Optimization
The Orthogonal arrays are helpful in guiding the heuristic algorithms to obtain a good solution when applied to NP-hard problems. This chapter deals with a new variant of PSO named Orthogonal PSO (OPSO) for solving the multiprocessor scheduling problem. The objective of applying the orthogonal concept in the basic PSO algorithm is to enhance the performance when applied to the scheduling proble...
متن کاملFeedback learning particle swarm optimization
In this paper, a feedback learning particle swarm optimization algorithm with quadratic inertia weight (FLPSOQIW) is developed to solve optimization problems. The proposed FLPSO-QIW consists of four steps. Firstly, the inertia weight is calculated by a designed quadratic function instead of conventional linearly decreasing function. Secondly, acceleration coefficients are determined not only by...
متن کاملLearning in Particle Swarm Optimization
This paper presents particle swarm optimization based on learning from winner particle. (PSO-WS). Instead of considering gbest and pbest particle for position update, each particle considers its distance from immediate winner to update its position. Only winner particle follow general velocity and position update equation. If this strategy performs well for the particle, then that particle upda...
متن کاملExtrapolated particle swarm optimization based on orthogonal design
To overcome the drawbacks of premature and poor convergence of classical PSO, a new particle swarm optimization is proposed by combining extrapolation technique and orthogonal design. Orthogonal design is introduced to design self-adaptive orthogonal crossover operator (SOC) which self-adaptively adjusts the number of orthogonal array’s factors and the location for dividing the parent particles...
متن کاملParticle Swarm Optimization with Double Learning Patterns
Particle Swarm Optimization (PSO) is an effective tool in solving optimization problems. However, PSO usually suffers from the premature convergence due to the quick losing of the swarm diversity. In this paper, we first analyze the motion behavior of the swarm based on the probability characteristic of learning parameters. Then a PSO with double learning patterns (PSO-DLP) is developed, which ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Evolutionary Computation
سال: 2011
ISSN: 1089-778X,1089-778X
DOI: 10.1109/tevc.2010.2052054